Optimizing heap memory usage

ABSTRACT

This disclosure provides a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program, and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data could be relatively large for a complex and long running program, data is processed to present it to a user in useful ways so that the programmer can improve the heap utilization in the program.

FIELD OF INVENTION

This invention relates generally a method for profiling software forefficiently computing durations of various phases of all heap memoryblocks created during life of a program to find potential optimizationin heap memory usage by reducing lag and drag in lifetimes of the heapmemory.

BACKGROUND OF THE INVENTION

As software applications become increasingly complex, they require alarge number of computing resources. For example, modern applicationssuch as Java Virtual Machines (JVMs) running memory intensive missioncritical J2EE applications, network management servers, databaseservers, web servers etc., require additional amounts of heap memory asthe size and complexity of the underlying task increases. However, justlike any other resource of a computing system, heap memory is finite fora given computer chip and Operating System combination. Therefore, it isimperative that heap memory should be utilized efficiently especially ina heap intensive application.

Typically life of a heap memory block has four important events: memoryallocation, first use, last use and memory de-allocation. As describedby N. Röjemo and C. Runciman, “Lag, drag, void and use—heap profilingand space-efficient compilation revisited,” Proceedings of ACM SIGPLANInternational Conference on Function Programming, pp. 34-41, 1996, andillustrated in FIG. 1 the duration between allocation and first use iscalled lag, the duration between first use and last use is called use,and the duration between last use and de-allocation is called drag. Ifthe memory is not used at all, the duration between allocation andde-allocation is called void.

The allocation event as illustrated in FIG. 1 is marked by a heap memoryallocation call such as malloc( ) method or new operator. The first useand last use events occur when any part of a heap block is used forfirst and last time respectively. For programming languages withexplicit heap memory management such as C/C++, de-allocation event ismarked by calling free( ) method or delete operator. For programminglanguages with implicit memory management, the de-allocation event ismarked when the last pointer/reference to that heap memory block is lostthereby making the memory block eligible for garbage collection. Itshould be noted that conventionally during the drag phase, a memoryblock is reachable but is not going to be used anymore. Such memoryblocks are also known as reachable memory leaks. Evidently, the realutilization of a heap block is only during the use phase. A program thathas a lot of heap blocks in lag, drag or void phases, is not utilizingheap efficiently. Software (hereinafter also referred to as program)that has a relatively large amount of heap blocks in lag, drag or voidphases, is not efficiently utilizing heap.

IBM® Rational® Purify® described in the following arts R. Hastings andB. Joyce, “Purify: Fast Detection of Memory Leaks and Access Errors,”Proceedings of the Winter Usenix Conference, pp. 125-136, 1992; in U.S.Pat. Nos. 5,193,180, 5,335,334 and 5,535,329 describe detecting memoryleaks by instrumenting object code. Using an algorithm similar to markand sweep garbage collection, it finds all heap memory blocks to whichthere is no direct or indirect pointer, which is an indication that theheap block has been leaked. A disadvantage with the above cited priorart being that lag and drag cannot be found in the reachable heap memoryblocks. Other tools such as Parasoft® Insure++® described in U.S. Pat.Nos. 5,581,696 and 5,842,019 have the same kind of deficiencies of notbeing sufficiently capable of analyzing lag and drag.

Additionally, several other attempts have been made to optimize heapusage, but have limitations due to scalability problems and/or failurein reducing lag and drag periods in the life of a heap memory block.Moreover, all these methods are designed for object oriented and garbagecollected programming languages, where the granularity is either objector fields. Such approaches are not applicable to programming languageslike C and C++ where heap memory can be accesses in arbitrarily andrandomly by using pointer arithmetic. In C/C++ programming language, theatomic unit is a byte rather than a field or object. Thus, updatingtimestamp at every byte access has a relatively large runtime costrendering these techniques unscalable and useless.

Without a way for providing a method and system for automaticallyproviding durations of lag, drag and void phases of all heap memoryblocks in a useful manner wherein a user can exploit this information todesign program modifications that will reduce or eliminate lag, drag andvoid phases leading to more efficient heap utilization and reducedmaximum and average heap requirements for the program, the promise ofthis technology may never be fully achieved. The technique described inthis invention is more generic and is applicable to programminglanguages such as C/C++, Java etc., by virtue of the fact that it isapplicable to the least-constrained heap memory model of C language, andhence becomes more efficient as a heap memory model become moreconstrained as in Java. Yet, it is efficient and scalable to be used foroptimizing large enterprise scale applications running for long durationof time. Moreover, the technique doesn't require access to ormodification in the source code and can be used with the system havingthird party binary libraries.

SUMMARY OF THE INVENTION

Disclosed is a system and a method for optimizing usage of heap memorywhile executing a program, comprising inserting additional instructionat predefined locations into a program, the additional instructionconfigured to search a header of a heap memory block to identify a lagand a drag. Creating a header for each heap memory block allocated,wherein the header is configured to record a size and allocation timefor each of the heap memory blocks. Collecting runtime data, the runtimedata stored in the header of the heap memory block comprising timestampsassociated with the lag and drag of the heap memory, wherein collectingruntime data comprises recording a de-allocation time in the header anddumping the header into a file when the memory block is freed.Identifying the lag and drag lifetimes associated with the heap memoryblock, thereby improving performance of the heap memory during executionof a program. To identify the lag and drag lifetimes a bit map table iscreated comprising two bits for all allocated heap memory, wherein thefirst bit indicates first use of the heap memory and the second bitindicates last use of the heap memory, the bit map table can be searchedand indicates the usage of the memory block.

For every use of the heap memory, if the first bit in the bit map tableis not set, the searching for the header of the corresponding heapmemory block and recording the current timestamp as the first usetimestamp, and updating the first use bit for all addresses associatedwith that heap memory block in the bit map table for that memory as 1.Subsequently setting the last use bit in the table for that memory to 1.A census is performed on the heap memory after a user defined durationwhich consists of sequentially sweeping through the heap memory whereinif header is found for the heap memory block, reading the size of theheap memory block in the header, and checking the bit map table for alladdresses associated with the heap memory block. If any last use bit hasa value 1 for a memory in that heap memory block, then recording acurrent timestamp as last used timestamp in the header; and setting lastuse bit for all memory in that heap memory block to a value zero.

BRIEF DESCRIPTION OF THE DRAWINGS

These and further aspects of the present invention will become apparentfrom and will be elucidated with respect to the embodiments describedhereinafter with reference to the accompanying drawings. The drawingsillustrate the embodiments of the invention, and together with thedescription, serve to further explain the principles of the invention.In the drawings

FIG. 1 illustrates various phases in the life of a heap memory block:lag, use, drag and void.

FIG. 2 illustrates code instrumentation 200 at interesting (predefined)locations in the program.

FIG. 1 illustrates initialization of the page table and censusinformation at the start of the program.

FIG. 2 illustrates the malloc wrapper 400 that replaces calls to mallocfunction.

FIG. 3 illustrates actions performed 500 for each malloc block in theheap while performing a census

FIG. 4 illustrates the function for performing heap census 600.

FIG. 5 illustrates the find_header function 700 for finding the headerof the malloc block that contains the given address.

FIG. 6 illustrates a method 800 for instrumentation for identifying thefirst use.

FIG. 7 illustrates a method 900 for instrumentation for identifying thelast use.

FIG. 8 illustrates a method 1000 where the free wrapper that replacescalls to free function.

FIG. 9 illustrates action 1110 to be performed while de-allocating aheap block.

FIG. 12 illustrates the wrapper 1200 to perform the last census whenprogram ends.

FIG. 13 illustrates a system 1300 on which FIGS. 2 to 12 may beimplemented.

DETAILED DESCRIPTION

In the following detailed description of exemplary embodiments of theinvention, reference is made to the accompanying drawings which form apart hereof, and in which is shown by way of illustration specificexemplary embodiments in which the invention may be practiced. Theseembodiments are described in sufficient detail to enable those skilledin the art to practice the invention, and it is to be understood thatother embodiments may be utilized and that logical, mechanical,electrical and other changes may be made without departing from thespirit or scope of the present invention. The following detaileddescription is, therefore, not to be taken in a limiting sense, and thescope of the present invention is defined only by the appended claims.Where reference is made in any one or more of the accompanying drawingsto steps and/or features, which have the same reference numerals, thosesteps and/or features have for the purposes of this description the samefunction(s) or operation(s), unless the contrary intention appears.

This disclosure provides a novel method to profile a program for findingpotential optimization in heap usage by reducing lag and drag inlifetimes of heap memory blocks. The process consists of three steps.First, an instrumentation engine analyzes a given program, and insertsadditional code at interesting locations to collect needed information.Second, when the instrumented program is executed on a set of testcases, runtime data is collected. Third, since this data could berelatively large for a complex and long running program, data isprocessed to present it to a user (also referred to as a programmer) inuseful ways so that the programmer can improve the heap utilization inthe program.

As illustrated in FIG. 2, there are five types of locations that need tobe instrumented: start of a program, memory allocation sites, memoryusage sites, memory de-allocation sites, and end of the program. Theinstrumentations begins are step 205 and in step 210 the type ofinstrumentations is determined. At the start of the program in step 220typically in accordance with the invention additional (also referred toas extra) code in inserted for initializing a page table that maintainsa bit mapping (also referred to as bit map table) for the heap memory,where 2 bits, which are initialized to zeros, are stored for each bytein the heap. The page table is similar to that as disclosed in IBM®Rational® Purify® but the meaning, purpose and usages of these bitsdiffer. The first bit represents the first use, and the second bitrepresents whether the byte has been used since the last (last use) heapcensus. Start of a program can be identified either by the main( )function in source code, or the _start location in an executable. A callto init_wrapper ( ) is inserted at this location as will be discussed inFIG. 3.

In step 230, the memory allocation occurs. For every memory allocation,additional space (called header) is allocated to store informationrelated to the events in the life cycle of the memory block, namely,allocation, first use, last use, and de-allocation. Current timestamp(or total heap memory allocated so far) is stored as allocation event,and rest of the events are initialized with zero. Memory allocation canbe identified by a call to malloc( ), which is intercepted and replacedby a call to malloc_wrapper( ). The size argument that is passed tomalloc( ) is passed to malloc_wrapper( ).

In step 240, memory usage is described. When a memory is read orwritten, two tasks are performed for tracking first use and last useevents. If the first use bit in the bit mapping for the memory addressis zero, then the header for the memory block is located and the currenttimestamp (or total heap memory allocated thus far) is stored as thefirst use event, and the first use bits in the bit mappings in the pagetable for all bytes in the same memory block are set to one, thereforethis operation happens only once for each heap memory block. Whenever avariable is used in source code or load/store instruction is used in theobject code, a call to first_use(addr) and last_use(addr) is insertedbefore the statement/instruction, where addr is the address of thememory that is about to be used.

For tracking the last use, unlike the methods listed in prior art whichperform expensive operation of locating the header and updating thetimestamp in it upon every use of a heap memory, the disclosed inventionperforms a much inexpensive operation of setting the last use bit in thebit mapping for the memory address to one, and deploys an economical andscalable approximation whose accuracy can be configured and controlledby the user. The method performs a heap census periodically, and a usercan define the period as time duration or as quantum of memoryallocations. During a heap census, every heap memory block in the heapmemory is examined. If any byte in the heap memory block has the lastuse bit set in the corresponding bit mapping in the page table, it meansthat the block has been used since the last census. Therefore the lastcensus works as a conservative approximation for the last use timestamp.The header of the heap memory block is updated to store the currentcensus identity as the last use of the heap memory block, and in thepage table, last use the bit is cleared for all bytes in that memoryblock.

In step 250 memory de-allocation occurs. When a heap memory block isfreed, the current timestamp (or total heap memory allocated so far) isstored as de-allocation event in the header, and the header is dumped ina file for further processing. Memory de-allocation can be identified bya call to free( ), which is intercepted and replaced by a call tofree_wrapper( ). The pointer argument that is passed to free( ) ispassed to free_wrapper( ). The header of the heap memory block isupdated to store the de-allocation time, and dump the complete headerinformation into a file for further processing. In step 260 end of theprogram is encountered, wherein the call to exit( ) function isintercepted and replaced by exit_wrapper( ), and the status argumentthat is passed to exit( ) is passed to exit_wrapper ( ). The completeheap is scanned, and for each live heap block, the tasks defined aboveunder the Memory De-allocation are performed. At step 210, if theinstruction is not of any type described for step 220, 230, 240, 260, itdetermined to be uninteresting and is left unchanged without insertingany additional code. After processing, in step 280 it is determined ifthere are further instructions for processing, if YES, control istransferred to step 210, if NO, then control is transferred to step 285,which terminates the method 200.

When the instrumented program terminates, the following data isavailable for every heap block allocated during the life of program:allocation time, first use time, last alive census identification(census id), de-allocation time, and corresponding call chains. And forevery census, the census time and the call chain at that time areavailable. This results in a relatively large amount of data for a longrunning complex program. The method 200 further discloses to consolidatethe data and a ranking system to identify allocation sites that have thehighest potential for heap usage reduction.

Advantages of the method include high scalability because of its uniqueapproximations to reduce the runtime overheads; moreover a user cancontrol the degree of approximation, efficiency and accuracy of the datacollection. A further advantage is that the method can be applied eitheras source code instrumentation (SCI) or object code instrumentation(OCI), or even a heterogeneous approach of applying SCI on some modulesand OCI on the remaining modules. Typically, applications are built bylinking with third party object libraries, for which source code is notavailable. Even in such situations, this method is effective because itcan operate on object code without requiring the source code. A furtheradvantage is that the ranking system is highly effective in quicklyidentifying the heap memory allocation sites with high potential forusage reduction. Though C/C++ is used here to describe the problem andsolution, the method, however, is independent of any specific languagefeatures, therefore it is applicable to any programming language. Themethod can be adapted to the language with garbage collection (e.g.Java) by using the garbage collection time as de-allocation time

The page table has a bit map (also referred to as a bit map table), andstores 2 bits for every byte of used heap memory. The first bitrepresent whether the corresponding byte has been used at least once,and the second bit represents whether the byte has been used since thelast census, as illustrated in the algorithm below:

typedef struct _ByteStatus {

-   -   int first_use:1;    -   int last_use:1;

} ByteStatus;

typedef struct _PageTable {

-   -   /* a space & time efficient BitMap<Address, ByteStatus>        -   * or HashTable<Address, ByteStatus>, or just a simple array.        -   */    -   ByteStatus* bitmap;

} PageTable;

PageTable page_table;

The page table is a bit mapping collection of all heap addresses. Pagetable can either be implemented either using an array of Status or aHashTable<address, status> as underlying data structure for providingfast access and manipulation. It can also be implemented using techniquesimilar to the one used in IBM® Rational® Purify®, where accessing andmanipulating the bit mapping is relatively fast, and a page gets createdonly when needed. In any of these cases, following methods are trivialto implement using access and update operations of underlying datastructure:

void init_page_table(PageTable *pt); bool get_first_use_bit(PageTable*pt, Address addr); bool get_last_use_bit(PageTable *pt, Address addr);void set_first_use_bit(PageTable *pt, Address addr, bool value); voidset_last_use_bit(PageTable *pt, Address addr, bool value); voidset_first_use_bit_range(PageTable *pt, Address start, Address end, boolvalue); void set_last_use_bit_range(PageTable *pt, Address start,Address end, bool value); void free_page_table(PageTable *pt);

The census record consists of the timestamp and call chain at the timeof starting census. Censuses are stored in an array, where census id canbe used as index for the array, and a variable is used to remember thecurrent census id. Census is performed whenever the total memoryallocation since the last census crosses a use defined threshold.

typedef struct _Census { time_t census_time; /* clock time when censusstarted */ Address* census_site; /* call chain when census started */ }Census; #define MAXCENSUS 1024 Census census_list[MAXCENSUS]; intcurrent_census; int CENSUS_THRESHOLD; int mallocs_since_last_census;

Census is performed on active heap memory specified by heap-start andheap-end. The mechanism to get call chain, heap-start and heap-end areplatform (hardware, operating system) dependent, but the mechanismexists on all platforms. Therefore, for the purpose of this disclosureit can be assumed that such mechanisms are exposed through followinginterfaces:

Address* get_stack_trace(int max_trace_length); extern Addressget_heap_start( ); extern Address get_heap_end( );The MAXCENSUS value used here is indicative, and in general can be setto any suitable and configurable value without requiring any change inthe method described here.

The malloc header is used to store various data related to a heap blockthat is utilized to compute lag, drag, void, and use. It is defined asfollowing:

/* magic number is a unique and rare occuring bit pattern */ #defineMALLOC_HEADER_MAGIC_NUMBER 0xABCDABCD typedef struct _MallocHeader { intmagic_number; time_t alloc_time; Address* alloc_site; time_tfirst_use_time; Address* first_use_site; int last_use_census; time_tdealloc_time; Address* dealloc_site; size_t size; } MallocHeader; voiddump_malloc_header(MallocHeader* header);This is a rather straightforward method to implement a function thatwrites value of each field in a malloc header into a file. These datastructures and functions are used in describing the code.Instrumentation. The MALLOC _(—) HEADER _(—) MAGIC _(—) NUMBER value isindicative, and any other value that doesn't or rarely occur in thememory can be chosen without requiring any change in the methoddescribed here.

At the start of the program as illustrated in FIG. 3, the method 300comprises initialization of the page table and census information. It isachieved by inserting a call to init_wrapper( ) function at the start ofprogram execution in step 310. In step 320 the page table is initializedby first setting the bitmap in pages for heap address range to “00”,meaning both first and last use bits are set to 0, and setting bitmap inpage table for non-heap address ranges to “11”, meaning both first andlast use bits are set to 1. The advantage here is in improvingefficiency since non-heap addresses doesn't need to be tracked for lag,drag, void and use. In step 330 the census information is initialized bysetting the current_census id to zero, setting the memory allocatedsince last census to zero, mallocs_since_last_census=0, and allowing theuser configured CENSUS_THRESHOLD value. Once the initialization iscompleted, the method return in step 240 to the next operation.

The malloc_wrapper function 400 is shown in FIG. 4. Memory allocation isdone by directly or indirectly calling malloc( ) function. Theinstrumentation engine replaces each call to malloc(size) by a call tomalloc_wrapper(size) in step 410, where size is the amount of memoryrequested to be allocated. The step 420 checks whether the user definedthreshold to perform census has been breached. If YES, then in step 440the method (method 600 as described in FIG. 6) to perform census isinvoked with record_census (method 500 as described in FIG. 5) actionhandler. If NO, or after doing step 440, in step 430, extra memory isallocated to store the malloc header for the heap block being allocated,and the header residing at the beginning of the allocated memory blockis initialized. In the malloc header, it saves the magic number at thebeginning, so that the start of the header and the memory block can beidentified while sweeping the heap for performing future censuses.Current timestamp and call chain is also stored in the header to markthe allocation time. The first use time, the last use census, andde-allocation time are initialized with zero. In step 450, a pointerthat is just after the header is returned to the caller of malloc( ).

FIG. 10 illustrates actions performed 500 for each malloc block in theheap while performing a census. The record_census function in step 510defines the action taken while performing the census. In step 520 forevery byte in the malloc block, the last use bit in the page table ischecked. In step 530 if the last use bit for any byte is found to beone, it indicates that the memory block has been used since the lastcensus. Then in step 540 the current census id is recorded in the mallocheader, and all last use bits in the page table for the malloc block areset to zero. Control returns in step 550.

FIG. 11 illustrates the function for performing heap census 600. Thecensus is essentially a single pass sweep of the heap. The step 610takes an action function to be executed for each malloc block found inthe heap. In step 620 the current census id is incremented by 1 andcensus id, current time stamp and call chain is recorded. In step 630,640 and 650, each memory from start to end of the heap is checked to seewhether the memory contains magic number indicating start of a memoryblock. In step 660, while sweeping the heap, if the magic number isfound, it indicates the start of the malloc header followed by themalloc block. The action function is executed by passing it the mallocheader. In step 670, when it reached end of the heap memory, the censusoperation completes

FIG. 12 illustrates the find_header function 700 for finding the headerof the malloc block that contains the given address. The find_header isa utility used while performing the instrumentation for memory useage.In step 710, it takes the memory address for which header needs to befound. In step 720, it casts the address to malloc header. In step 730,740, 750, for a given address, it checks whether the address is withinheap limits and traverses the heap in backward direction looking for themagic number. When found, in step 760, it uses the heap block sizestored in the header to verify that the given address lies within theblock. If true, in step 775, it returns the start of the malloc header,else it returns NULL in step 780 indicating failure.

FIG. 13 illustrates method 800 for instrumentation for identifying thefirst use. The memory usage occurs whenever a variable is used in thesource code or whenever a load or store instruction is used in theobject code to access a memory. The first_use in step 810 takes theaddress for which first use check needs to be done. In step 820 it firstchecks if the address of the memory about to be used falls in the heap,and then in step 830 if the first use bit for the address is already setto one in the page table. If not, then this memory block is about to beused for the first time. In step 840 the malloc header is located bycalling find_header. In step 850, the header is checked. If header innot NULL then in step 860 the current time and call chain is recorded inthe header as the first use time and location. For all bytes in theblock, the first use bit in the page table is set to one to preventrepeating this action for all future uses of all bytes belonging to thisheap block. Control returns in step 870

FIG. 14 illustrates a method 900 for instrumentation for identifying thelast use. The last_use function performs an inexpensive operation ofsetting the last use bit for the address in the page table to one.During the next census, this will indicate that the heap block is usedand the census will be recorded in the malloc header as last use census.In step 910, it takes the address for which last use check needs to bedone. In step 820, it checks if the address is within heap limits. IfYES, then in step 930, it sets the last use bit corresponding to theaddress in the bit map table to one. Control returns in step 940.

FIG. 15 illustrates a method 1000 where the free wrapper that replacescalls to free function. Memory de-allocation is done by directly orindirectly calling free( ) function. The instrumentation engine replaceseach call to free(ptr) by a call to free_wrapper(ptr) of step 820 asdescribed previously in FIG. 8, where ptr is the pointer requested to befreed. The step 1020 first finds the malloc header by callingfind_header as illustrated previously in FIG. 7. Then as illustrated inFIG. 11 calls record_dealloc_and_save_data to record the current timeand call chain as the de-allocation time and location in the mallocheader, to dump the malloc header information into a file forpost-processing, and to do clean up (clear the magic number in themalloc header and page table entries for bytes belonging to the currentheap block). Control returns in step 1030.

FIG. 11 illustrates a method 1100 that records the de-allocationtimestamp and dumps the header data into a file for further processingto compute lag and drag. The step 1110 takes a malloc header to process.The step 1120 first computes start and end of the memory block. Themalloc header is just before the memory block, so the start of the blockis computing by using the size of malloc header, and end is computedusing the block size stored in the header. The current call chain andtime stamp is stored in the header as de-allocation time andde-allocation site. Then the data is dumped into a file and for alladdresses in the memory, the first use and last use bits in the bitmaptable are set to zero. Control returns in step 1130.

FIG. 12 illustrates the wrapper 1200 to perform the last census whenprogram ends. At the end of a program, the exit function is called witha status code. The instrumentation engine replaces the exit(status) callto exit_wrapper(status). In step 1210 the exit_wrapper takes the statusargument. In step 1220, the action function is set torecord_dealloc_and_save_data(as described previously in FIG. 11) andlast census is performed, however. In this census, for every heap block,the exit time is recorded as the de-allocation time, and the mallocheader of the heap block is dumped for post-processing, and the heapblock is freed. After performing the last census, the real exit iscalled to terminate the program. Control returns in step 1230.

As described previously for code instrumentation, for each census,timestamp and the call chain are recorded. And for each memory block,timestamp and call chain at the time of allocation, first use andde-allocation of the memory block, size and the last use census id arerecorded. The last use census id is used to extract the timestamp andcall site for the last use of the block from the census record. Thisleads to following tuple for each memory block: <size, allocation-time,allocation-site, first-use-time, first-use-site, last-use-time, andlast-use-site, deallocation-time, deallocation-site>. These tuples havefollowing properties:

-   -   1. The allocation-time is unique, i.e. no two tuples have same        allocation-time, therefore allocation-time can be used as an        identity for a memory block.    -   2. This condition is true for all memory records:        (allocation-time<=first-use-time<=last-use-time<=deallocation-time)        OR (allocation-time<=deallocation-time AND first-use-time==0 AND        last-use-time==0)    -   3. Since the records for memory blocks are dumped when they are        freed, the records exist sorted in the ascending order of        deallocation-time.        Lag, drag, use and void for a tuple can be computed as        following:

If first-use-time == 0 (last-use-time == 0 will also be true): lag = 0,use =0, drag = 0, void = size * (deallocation-time − allocation-time)Else lag = size * (first-use-time − allocation-time) use = size *(last-use-time − first-use-time) drag = size * (deallocation-time −last-use-time) void = 0

Memory records with same allocation-site (allocation call chain) areclubbed together. The lag, drag, void and use for each allocation siteis computed by adding lag, drag, void and use respectively forindividual memory blocks with the same allocation-site. This resultsinto following tuples: <allocation-site, lag, drag, void, use>. Thesetuples are then ranked by sorting them in the descending order of waste,where waste is defined as (lag+drag+void), and presented to the user ina tabular format. Such ranking makes it easy for a user to identify themost wasteful allocation sites in the program and improve the logic toreduce the wastage of heap memory. If user desires, the information canbe sorted on any other column: lag, drag, void, use, percentage ofwaste, % lag, % drag, % void, % use, etc.

It should be apparent to a person skilled in the art that someenhancements that can coexist with the above embodiments. Various typesof inter and intra procedural data and control flow analysis can beperformed at both source code and object code level to eliminateredundant instrumentations. For example, if in a basic block, a memorylocation is accessed more than once, or multiple bytes of same memoryblocks are accessed (e.g. multiple fields of an structure), then onlythe first and the last accesses need to be instrumented for datacollection. Similarly, since this analysis only tracks heap memoryaccess, there is no need to instrument any memory read or write donethrough an offset from the stack pointer ($sp) or local variable.

The above embodiments may be implemented using a computer system(computing device) 1300, such as that shown in FIG. 13. The processesdescribed may be implemented as software, such as, as one or moreapplication programs executable within the computer system 1300. Inparticular, the steps of the process may be realized by instructions inthe software that are carried out within the computer system 1300. Theinstructions may be formed as one or more program code modules, each forperforming one or more particular tasks. The software may be stored in acomputer readable medium, including the storage devices described below,for example. The software is loaded into the computer system 1300 fromthe computer readable medium, and then executed by the computer system1300. A computer readable medium having such software or computerprogram recorded on it is a computer program product.

As seen in FIG. 13, the computer system 1300 is formed by a computermodule 1301, input devices such as a keyboard 1302 and a mouse pointerdevice 1303, and output devices including a printer 1315, a displaydevice 1314 and loudspeakers 1317. An external Modulator-Demodulator(Modem) transceiver device 1316 may be used by the computer module 1301for communicating to and from a communications network 1320 via aconnection 1321. The network 1320 may be a wide-area network (WAN) suchas the Internet or a private WAN. Where the connection 1321 is atelephone line, the modem 1316 may be a traditional “dial-up” modem.Alternatively, where the connection 1321 is a high capacity (e.g. cable)connection, the modem 1316 may be a broadband modem. A wireless modemmay also be used for wireless connection to the network 1320.

The computer module 1301 typically includes at least one processor unit1305, and a memory unit 1306 for example formed from semiconductorrandom access memory (RAM) and read only memory (ROM). The module 1301also includes a number of input/output (I/O) interfaces including anaudio-video interface 1307 that couples to the video display 1314 andloudspeakers 1317, an I/O interface 1313 for the keyboard 1302 and mouse1303 and optionally a joystick (not illustrated), and an interface 1308for the external modem 1316 and printer 1315. In some implementations,the modem 1316 may be incorporated within the computer module 1301, forexample within the interface 1308. The computer module 1301 also has alocal network interface 1311 which, via a connection 1323, permitscoupling of the computer system 1300 to a local computer network 1322,known as a Local Area Network (LAN). As also illustrated, the localnetwork 1322 may also couple to the wide area network 1320 via aconnection 1324, which would typically include a so-called “firewall”device or similar functionality. The network interface 1311 may beformed by an Ethernet™ circuit card, a wireless Bluetooth™ or an IEEE802.11 wireless arrangement.

The interfaces 1308 and 1313 may afford both serial and parallelconnectivity, the former typically being implemented according to theUniversal Serial Bus (USB) standards and having corresponding USBconnectors (not illustrated). Storage devices 1309 are provided andtypically include a hard disk drive (HDD) 1310. Other devices such as afloppy disk drive and a magnetic tape drive (not illustrated) may alsobe used. An optical disk drive 1312 is typically provided to act as anon-volatile source of data. Portable memory devices, such optical disks(eg: CD-ROM, DVD), USB-RAM, and floppy disks for example may then beused as appropriate sources of data to the system 1300.

The components 1305, to 1313 of the computer module 1301 typicallycommunicate via an interconnected bus 1304 and in a manner which resultsin a conventional mode of operation of the computer system 1300 known tothose in the relevant art. Examples of computers on which the describedarrangements can be practised include IBM-PC's and compatibles, SunSparcstations, Apple Mac™ or alike computer systems evolved therefrom.

Typically, the application programs discussed above are resident on thehard disk drive 1310 and read and controlled in execution by theprocessor 1305. Intermediate storage of such programs and any datafetched from the networks 1320 and 1322 may be accomplished using thesemiconductor memory 1306, possibly in concert with the hard disk drive1310. In some instances, the application programs may be supplied to theuser encoded on one or more CD-ROM and read via the corresponding drive1312, or alternatively may be read by the user from the networks 1320 or1322. Still further, the software can also be loaded into the computersystem 1300 from other computer readable media. Computer readable mediarefers to any storage medium that participates in providing instructionsand/or data to the computer system 1300 for execution and/or processing.Examples of such media include floppy disks, magnetic tape, CD-ROM, ahard disk drive, a ROM or integrated circuit, a magneto-optical disk, ora computer readable card such as a PCMCIA card and the like, whether ornot such devices are internal or external of the computer module 1301.Examples of computer readable transmission media that may alsoparticipate in the provision of instructions and/or data include radioor infra-red transmission channels as well as a network connection toanother computer or networked device, and the Internet or Intranetsincluding e-mail transmissions and information recorded on Websites andthe like.

The operations disclosed may alternatively be implemented in dedicatedhardware such as one or more integrated circuits performing thefunctions or sub functions of the described processes. Such dedicatedhardware may include graphic processors, digital signal processors, orone or more microprocessors and associated memories.

The accompanying figures and this description depicted and describedembodiments of the present invention, and features and componentsthereof. Those skilled in the art will appreciate that any particularprogram nomenclature used in this description was merely forconvenience, and thus the invention should not be limited to use solelyin any specific application identified and/or implied by suchnomenclature. Therefore, it is desired that the embodiments describedherein be considered in all respects as illustrative, not restrictive,and that reference be made to the appended claims for determining thescope of the invention.

Although the invention has been described with reference to theembodiments described above, it will be evident that other embodimentsmay be alternatively used to achieve the same object. The scope of theinvention is not limited to the embodiments described above, but canalso be applied to software programs and computer program products ingeneral. It should be noted that the above-mentioned embodimentsillustrate rather than limit the invention and that those skilled in theart will be able to design alternative embodiments without departingfrom the scope of the appended claims. In the claims, any referencesigns should not limit the scope of the claim. The invention can beimplemented by means of hardware comprising several distinct elements.

1. A computer implemented method for optimizing usage of heap memory,the method comprising inserting additional instruction at predefinedlocations into a program, the additional instruction configured tosearch a header of a heap memory block to identify a lag and a drag;creating a header for each heap memory block allocated; collectingruntime data, the runtime data stored in the header of the heap memoryblock comprising timestamps associated with the lag and drag of the heapmemory; and identifying the lag and drag lifetimes associated with theheap memory block, thereby improving performance of the heap memoryduring execution of a program.
 2. The method of claims 1, wherein theheader is configured to record a size and allocation time for each ofthe heap memory blocks when the heap memory block is allocated.
 3. Themethod of claim 1, wherein collecting runtime data further comprisesrecording a de-allocation time in the header; and dumping the headerinto a file when the memory block is freed.
 4. The method of claim 1,further comprises creating a bit map table comprising two bits for allallocated heap memory.
 5. The method of claim 4, wherein the first bitindicates first use of the heap memory and the second bit indicates lastuse of the heap memory.
 6. The method of claim 4, wherein for every useof the heap memory if the first bit in the bit map table is not set,searching for the header of the corresponding heap memory block andrecording the current timestamp as the first use timestamp; updating thefirst use bit for all addresses associated with that heap memory blockin the bit map table for that memory as 1; and setting the last use bitin the table for that memory to
 1. 7. The method of claim 6, wherein thelast bit is always set regardless of whether first bit is set.
 8. Themethod of claim 6, further comprises performing a census after a userdefined duration comprising sequentially sweeping through the heapmemory wherein if header is found for the heap memory block; reading thesize of the heap memory block in the header; checking the bit map tablefor all addresses associated with the heap memory block; if any last usebit has a value 1 for a memory in that heap memory block, recording acurrent timestamp as last used timestamp in the header; and setting lastuse bit for all memory in that heap memory block to a value zero
 9. Amethod for optimizing heap memory usage, the method comprising insertingadditional instruction at predefined locations into a program, theadditional instruction configured to search a header of a heap memoryblock to identify a lag and a drag; creating a header for each heapmemory block allocated, the header configured to record a size andallocation time for each of the heap memory blocks when the heap memoryblock is allocated; collecting runtime data, the runtime data stored inthe header of the heap memory block comprising timestamps associatedwith the lag and drag of the heap memory, recording a de-allocation timein the header; dumping the header into a file when the memory block isfreed; identifying the lag and drag lifetimes associated with the heapmemory block form a bit map table comprising two bits the first bitindicates first use of the heap memory and the second bit indicates lastuse of the heap memory wherein for every use of the heap memory if thefirst bit in the bit map table is not set, searching for the header ofthe corresponding heap memory block and recording the current timestampas the first use timestamp; updating the first use bit for all addressesassociated with that heap memory block in the bit map table for thatmemory as 1; and setting the last use bit in the table for that memoryto 1, thereby improving performance of the heap memory during executionof a program.
 10. The method of claim 9, further comprises performing acensus after a user defined duration comprising sequentially sweepingthrough the heap memory wherein if header is found for the heap memoryblock; reading the size of the heap memory block in the header; checkingthe bit map table for all addresses associated with the heap memoryblock; if any last use bit has a value 1 for a memory in that heapmemory block, recording a current timestamp as last used timestamp inthe header; and setting last use bit for all memory in that heap memoryblock to a value zero
 11. A computing system comprising a processor, amemory, a computer readable medium coupled to the processor; andcomputer instruction encoded in the computer readable medium andexecutable by the processor to causing the processor for: insertingadditional instruction at predefined locations into a program, theadditional instruction configured to search a header of a heap memoryblock to identify a lag and a drag; creating a header for each heapmemory block allocated when the heap memory block is allocated;collecting runtime data, the runtime data stored in the header of theheap memory block comprising timestamps associated with the lag and dragof the heap memory; and identifying the lag and drag lifetimesassociated with the heap memory block, thereby improving performance ofthe heap memory during execution of a program.
 12. The system of claims11, wherein the header is configured to record a size and allocationtime for each of the heap memory blocks.
 13. The system of claim 11,wherein collecting runtime data further comprises recording ade-allocation time in the header; and dumping the header into a filewhen the memory block is freed.
 14. The system of claim 11, wherein abit map table is created comprising two bits for all allocated heapmemory.
 15. The system of claim 14, wherein the first bit indicatesfirst use of the heap memory and the second bit indicates last use ofthe heap memory.
 16. The system of claim 14, wherein for every use ofthe heap memory if the first bit in the bit map table is not set,searching for the header of the corresponding heap memory block andrecording the current timestamp as the first use timestamp; updating thefirst use bit for all addresses associated with that heap memory blockin the bit map table for that memory as 1; and setting the last use bitin the table for that memory to
 1. 17. The system of claims 16, furthercomprises performing a census after a user defined duration comprisingsequentially sweeping through the heap memory wherein if header is foundfor the heap memory block; reading the size of the heap memory block inthe header; checking the bit map table for all addresses associated withthe heap memory block; if any last use bit has a value 1 for a memory inthat heap memory block, recording a current timestamp as last usedtimestamp in the header; and setting last use bit for all memory in thatheap memory block to a value zero